This paper describes a quantum algorithm for finding the maximum among Nitems. The classical method for the same problem takes O(N) steps because weneed to compare two numbers in one step. This algorithm takes O(sqrt(N)) stepsby exploiting the property of quantum states to exist in a superposition ofstates and hence performing an operation on a number of elements in one go. Atight upper bound of 6.8(sqrt(N)) for the number of steps needed using thisalgorithm was found. These steps are the number of queries made to the oracle.
展开▼
